CP with ACO
نویسندگان
چکیده
The Ant Colony Optimization (ACO) meta-heuristic [1] has proven its efficiency to solve hard combinatorial optimization problems. However most works have focused on designing efficient ACO algorithms for solving specific problems, but not on integrating ACO within declarative languages so that solving a new problem with ACO usually implies a lot of procedural programming. Our approach is thus to explore the tight integration of Constraint Programming (CP) with ACO. Our research is based upon ILOG Solver, and we use its modeling language and its propagation engine, but the search is guided by ACO. This approach has the benefit of reusing all the work done at the modeling level as well as the code dedicated to constraint propagation and verification.
منابع مشابه
Integration of ACO in a Constraint Programming Language
We propose to integrate ACO in a Constraint Programming (CP) language. Basically, we use the CP language to describe the problem to solve by means of constraints and we use the CP propagation engine to reduce the search space and check constraint satisfaction; however, the classical backtrack search of CP is replaced by an ACO search. We report first experimental results on the car sequencing p...
متن کاملUsing ACO to guide a CP search
Despite its doubtless success, Constraint Programming (CP) has to face two main challenges to develop its success: solving harder and harder problems, and being accessible to users with little to no CP expertise. To address these challenges, we are exploring the use of Ant Colony Optimization (ACO) to solve problems expressed in a regular CP Solver: ILOG Solver. Basically, ants iteratively buil...
متن کاملA Hybrid ACO+CP for Balancing Bicycle Sharing Systems
Balancing bike sharing systems is an increasingly important problem, because of the rising popularity of this mean of transportation. Bike sharing systems need to be balanced so that bikes (and empty slots for returning bikes) are available to the customers, thus ensuring an adequate level of service. In this paper, we tackle the problem of balancing a real-world bike sharing system (BBSS) by m...
متن کاملAnalysis of Crowding Population Based Ant Colony Optimization for Service Restoration Problem in Distribution System
The crowding population based ant colony optimization algorithm (CP-ACO) uses a different pheromone update in comparison to other ACO algorithms. In this paper, crowding population based ant colony optimization algorithm is proposed to solve service restoration problem. The most notable achievement featured in this paper is run time reduction of algorithm to solve the service restoration task. ...
متن کاملOptimisation sous contraintes par intelligence collective auto-adaptative. (Strong combination of ant colony optimization with constraint programming optimization)
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using the CP Optimizer modeling API. Then, it is solved in a generic way by a two-phase algorithm. The first phase aims at creating a hot start for the second: it samples the solution space and applies reinforcement learni...
متن کامل